#include <bits/stdc++.h>
using namespace std;
int a[100005];
deque<int> q;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n,b;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        if(!q.empty()&&a[i]>q.front()) q.pop_front();
        q.push_back(a[i]);
    }
    cout<<q.size();
    return 0;
}
